Dynamic Setting, Verification and Adjustment of Upper Bound Constraints in Grid Workflow Systems
نویسندگان
چکیده
Upper bound constraints are often set when complex scientific or business processes are modelled as grid workflow specifications. However, many existing processes such as climate modelling or international stock market analysis often have only one end-to-end upper bound constraint. This is not sufficient to control overall temporal correctness as we may not find temporal violations until the last activity. Then, it is too late to take any handling actions. Consequently, the execution results may not be useful and overall cost-effectiveness would be impacted. Therefore, in this paper, we systematically investigate how to set, verify and adjust sub-upper bound constraints within the timeframe of one end-to-end upper bound constraint so that we can control grid workflow execution locally. We develop corresponding setting, verification and adjustment methods and algorithms. The quantitative evaluation demonstrates that with sub-upper bound constraints, we can achieve better cost-effectiveness than only based on one end-to-end upper bound constraint.
منابع مشابه
Temporal Dependency for Dynamic Verification of Fixed-Date Constraints in Grid Workflow Systems
Grid workflow systems aim to support large-scale complex e-science and e-business processes. Due to the complexity of these kinds of processes, to control the execution of them in terms of time in the grid workflow execution environment, multiple fixed-date temporal constraints often need to be set simultaneously. Hence the dependency problem between them must be considered and emphasised, whic...
متن کاملSelecting Necessary and Sufficient Checkpoints for Dynamic Verification of Fixed-Time Constraints in Grid Workflow Systems
In grid workflow systems, existing representative checkpoint selection strategies, which are used to select checkpoints for verifying fixed-time constraints at run-time execution stage, often select some unnecessary checkpoints and ignore some necessary ones. Consequently, overall temporal verification efficiency and effectiveness can be severely impacted. In this paper, we propose a new strate...
متن کاملAn Activity Completion Duration based Checkpoint Selection Strategy for Dynamic Verification of Fixed-time Constraints in Grid Workflow Systems
In grid workflow systems, to verify fixed-time constraints efficiently at the run-time execution stage, some checkpoints are often selected so that we only need to conduct the fixed-time constraint verification at such checkpoints rather than at all activity points. However, the existing typical checkpoint selection strategies are inefficient and/or ineffective because they may incur some unnec...
متن کاملActivity Completion Duration Based Checkpoint Selection for Dynamic Verification of Temporal Constraints in Grid Workflow Systems
In grid workflow systems, to verify temporal constraints efficiently at run-time execution stage, some checkpoints are often selected so that we only need to conduct temporal verification at such checkpoints rather than at all activity points. However, existing typical checkpoint selection strategies often ignore some necessary checkpoints and select some unnecessary ones. This would eventually...
متن کاملSeparable programming problems with the max-product fuzzy relation equation constraints
In this paper, the separable programming problem subject to Fuzzy Relation Equation (FRE) constraints is studied. It is decomposed to two subproblems with decreasing and increasing objective functions with the same constraints. They are solved by the maximum solution and one of minimal solutions of its feasible domain, respectively. Their combination produces the original optimal solution. The ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006